Adaptive tracking of representative cycles in regular and zigzag persistent homology

نویسندگان

  • Jennifer Gamble
  • Harish Chintakunta
  • Hamid Krim
چکیده

Persistent homology and zigzag persistent homology are techniques which track the homology over a sequence of spaces, outputting a set of intervals corresponding to birth and death times of homological features in the sequence. This paper presents a method for choosing a homology class to correspond to each of the intervals at each time point. For each homology class a specific representative cycle is stored, with the choice of homology class and representative cycle being both geometrically relevant and compatible with the birth-death interval decomposition. After describing the method in detail and proving its correctness, we illustrate the utility of the method by applying it to the study of coverage holes in time-varying sensor networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tracking a Generator by Persistence

The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute not only the persistent homology for a filtered simplicial complex, but also representative generating cycles for persistent homology groups. However, if there are dynamic changes either in the filtration or in the underlyi...

متن کامل

Coordinate-free quantification of coverage in dynamic sensor networks

We present a novel set of methods for analyzing coverage properties in dynamic sensor networks. The dynamic sensor network under consideration is studied through a series of snapshots, and is represented by a sequence of simplicial complexes, built from the communication graph at each time point. A method from computational topology called zigzag persistent homology takes this sequence of simpl...

متن کامل

Applications of Zigzag Persistence to Topological Data Analysis

The theory of zigzag persistence is a substantial extension of persistent homology, and its development has enabled the investigation of several unexplored avenues in the area of topological data analysis. In this paper, we discuss three applications of zigzag persistence: topological bootstrapping, parameter thresholding, and the comparison of witness complexes.

متن کامل

Zigzag Persistence

We describe a new methodology for studying persistence of topological features across a family of spaces or point-cloud data sets, called zigzag persistence. Building on classical results about quiver representations, zigzag persistence generalises the highly successful theory of persistent homology and addresses several situations which are not covered by that theory. In this paper we develop ...

متن کامل

Zigzag Persistence via Reflections and Transpositions

We introduce a new algorithm for computing zigzag persistence, designed in the same spirit as the standard persistence algorithm. Our algorithm reduces a single matrix, maintains an explicit set of chains encoding the persistent homology of the current zigzag, and updates it under simplex insertions and removals. The total worst-case running time matches the usual cubic bound. A noticeable diff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1411.5442  شماره 

صفحات  -

تاریخ انتشار 2014